# -*- coding: UTF-8 -*-
from typing import List

from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def maxProduct(self, nums: List[int]) -> int:
        nums_len = len(nums)
        if nums_len == 1:
            return nums[0]

        mins = [0 for _ in range(nums_len)]
        maxs = [0 for _ in range(nums_len)]

        mins[0] = nums[0]
        maxs[0] = nums[0]
        for i in range(1, nums_len):
            mins[i] = min(nums[i], min(mins[i-1] * nums[i], maxs[i-1] * nums[i]))
            maxs[i] = max(nums[i], max(mins[i-1] * nums[i], maxs[i-1] * nums[i]))

        return max(maxs)


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([-1, -2, -9, -6], 108),
        ([2, 3, -2, 4], 6),
        ([-2, 0, -1], 0)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.maxProduct(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

